Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks

نویسنده

  • Christian Boulinier
چکیده

How to pass from local to global scales in anonymous networks? In such networks, how to organize a self-stabilizing propagation of information with feedback? From Angluin’s results, the deterministic leader election is impossible in general anonymous networks. Thus, it is impossible to build a rooted spanning tree. In this paper we show how to use Unison to design a selfstabilizing barrier synchronization in an anonymous network. We show that the communication structure of this barrier synchronization designs a self-stabilizing wave stream, or pipelined wave, in anonymous networks. We introduce two variants of waves: Strong Wave and Wavelet. Strong waves can be used to solve the idempotent r-operator parametrized problem, which implies well known problems like depth-first search tree construction – this instance requires identities for the processors. Wavelets deal with ρ-distance computation. We show how to use Unison to design a self-stabilizing strong wave stream, and wavelet stream respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-stabilizing Byzantine Asynchronous Unison,

We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm h...

متن کامل

Low-Communication Self-stabilizing Leader Election in Large Networks

This paper makes two contributions: (1) On a completely connected network of n anonymous processes, it presents a synchronous randomized algorithm to solve the weak leader election problem in expected O(1) time using O( √ n logn) messages with high probability, (2) It presents a self-stabilizing algorithm for the strong leader election problem on a completely connected network of processes with...

متن کامل

Dynamic FTSS in Asynchronous Systems: the Case of Unison

Distributed fault-tolerance can mask the effect of a limited number of permanent faults, while self-stabilization provides forward recovery after an arbitrary number of transient fault hit the system. FTSS protocols combine the best of both worlds since they are simultaneously fault-tolerant and self-stabilizing. To date, FTSS solutions either consider static (i.e. fixed point) tasks, or assume...

متن کامل

Self-Stabilizing -out-of- Exclusion

In this paper, self-stabilizing asynchronous distributed algorithms are given for the -out-ofexclusion problem, a generalization of the mutual exclusion problem, in which there are units of a resource, and any process can request up to units. We consider two network topologies, a tree and a unidirectional ring. The networks are anonymous except for one distinguished process. The ring algorithm ...

متن کامل

Gradual Stabilization under τ -Dynamics

We introduce the notion of gradually stabilizing algorithm as any self-stabilizing algorithm achieving the following additional feature. Assuming that at most τ dynamic steps occur starting from a legitimate configuration, a gradually stabilizing algorithm first quickly recover to a configuration from which a specification offering a minimum quality of service is satisfied. It then gradually co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0706.4298  شماره 

صفحات  -

تاریخ انتشار 2007